Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation
نویسندگان
چکیده
Abstract rewriting systems are often defined as binary relations over a given set of objects. In this paper, we introduce a new notion of abstract rewriting system in the framework of categories. Then, we define the functoriality property of rewriting systems. This property is sometimes called vertical composition. We show that most graph transformation systems are functorial and provide a counterexample of graph transformation system which is not functorial.
منابع مشابه
M,N -Adhesive Transformation Systems
The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N -adhesive transformation systems, where N is a class of morphisms containing the...
متن کاملAdhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobociński. In this paper we show that most of the HLR properties, which had been introduced to generalize some basic resu...
متن کاملConditional Reactive Systems
We lift the notion of nested application conditions from graph transformation systems to the general categorical setting of reactive systems as defined by Leifer and Milner. This serves two purposes: first, we enrich the formalism of reactive systems by adding application conditions for rules; second, it turns out that some constructions for graph transformation systems (such as computing weake...
متن کاملAn inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operationally, in the sense that a way of embedding a rule into a state is devised, stating explicitly how the result is built: This is the role played by (the application of) a substitution in term rewriting. Or inductively...
متن کاملAdhesive High-Level Replacement Categories and Systems: Long Version
Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobociński. In this paper we show that most of the HLR properties, which had been introduced ad hoc to generalize some basic re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ECEASST
دوره 41 شماره
صفحات -
تاریخ انتشار 2011